Adaptive AMG with coarsening based on compatible weighted matching
نویسندگان
چکیده
منابع مشابه
An energy-based AMG coarsening strategy
Algebraic multigrid (AMG) is an iterative method that is often optimal for solving the matrix equations that arise in a wide variety of applications, including discretized partial differential equations. It automatically constructs a sequence of increasingly smaller matrix problems that hopefully enables efficient resolution of all scales present in the solution. The methodology is based on mea...
متن کاملAdaptive reduction-based AMG
With the ubiquity of large-scale computing resources has come significant attention to practical details of fast algorithms for the numerical solution of partial differential equations. Included in this group are the class of multigrid and algebraic multigrid algorithms that are effective solvers for many of the large matrix problems arising from the discretization of elliptic operators. Algebr...
متن کاملCoarsening by compatible relaxation
A proper coarse variable set for Algebraic Multigrid (AMG) solvers can be constructed using Compatible Relaxation (CR). For a given coarse set, CR is a modified relaxation scheme that keeps the values of the coarse variables intact. Its convergence factor is a predictor of the potential AMG efficiency, similarly to the smoothing factor in geometric multigrid. A practical CR-based coarse set con...
متن کاملCompatible coarsening in the multigraph algorithm
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]. In particular, approximate left and right eigenvectors of the iteration matrix for the smoother are used in computing both the sparsity pattern and the numerical values of the transfer matrices that correspond to res...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing and Visualization in Science
سال: 2013
ISSN: 1432-9360,1433-0369
DOI: 10.1007/s00791-014-0224-9